Collecting Information by Random Memory Less Mobile Agents

In this report, we investigate the following problem: k mobile agents are placed in a network of processors. Each agent has a limited knowledge and moves randomly in the network which means that the agents are not intelligent and do not have computational capabilities. When the agents meet in a node of the underlying graph, they merge in a single agent and the knowledge of this agent is the union of the all the agents’ knowledge. The parameter of interest is the expected time for all the agents to merge in a single agent. We obtain efficient results for particular classes of graphs; such as star graphs, complete graphs and hypercubes when two or more agents meet in a network.